Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009
نویسندگان
چکیده
We present two approaches for the Euclidean TSP which compute high quality tours for large instances. Both approaches are based on pseudo backbones consisting of all common edges of good tours. The first approach starts with some pre-computed good tours. Using this approach we found record tours for seven VLSI instances. The second approach is window based and constructs from scratch very good tours of huge TSP instances, e. g., the World TSP.
منابع مشابه
12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)
Weare pleased to present this special issue ofDiscrete AppliedMathematics, which is devoted to the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2013), held at the University of Twente, Enschede, The Netherlands, between May 21 and May 23, 2013. More than 80 scientists from all over the world attended the workshop, and we take this opportunity to thank all CTW 2013 ...
متن کامل12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013
Locations Sessions. All technical sessions take place in the Vrijhof (building 47 on the campus map) in the lecture halls Amphitheater and Audiozaal. Internet You can use " eduroam " to connect to the internet. If you have internet access in your hotel on the campus and have obtained an account for that purpose, you can use the " UT Guest " network. If neither of these options works, you can us...
متن کاملCTW 16 14 th Cologne - Twente Workshop on Graphs and Combinatorial Optimization Università degli
The shared broadcast tree (SBT) problem in Euclidean graphs resembles the minimum spanning tree (MST) problem, but differs from MST in the definition of the objective function. The SBT problem is known to be NP-hard. In the current work, we analyse how closely the MST-solution approximates the SBT-solution, and we prove in particular that the approximation ratio is at least 6. Further, we condu...
متن کاملSeventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, gargano, Italy, 13-15 May, 2008
Let H and G be graph classes. We say that H has the Erdős-Pósa property for G if for any graph G ∈ G, the minimum vertex covering of all H-subgraphs of G is bounded by a function f of the maximum packing of H-subgraphs in G (by H-subgraph of G we mean any subgraph of G that belongs to H). In his monograph “Graph Theory”, R. Diestel proves that if H is the class of all graphs that can be contrac...
متن کاملQuantitative estimation of calcium dynamics from ratiometric
Quantitative estimation of calcium dynamics from ratiometric 1 measurements: a direct, non-ratioing, method 2 3 4 5 Sébastien Joucla , Andreas Pippow 2 , 6 Peter Kloppenburg 2 and Christophe Pouzat 7 8 9 10 1 Cerebral Physiology Laboratory, Université Paris-Descartes, CNRS, UMR 8118, 11 45 rue des Saints-Pères, 75006 Paris, France 12 13 14 2 Institute of Zoology and Physiology, Center for Molec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009